Bounded continuously distributed delays in dynamic oligopolies
نویسندگان
چکیده
منابع مشابه
Dynamic monopoly with multiple continuously distributed time delays
Two time delays are assumed in a boundedly rational monopoly. The characteristic equation is derived for the general case, and a complete stability analysis is conducted both analytically and numerically in two special cases. In the first case in which the continuously distributed time delays have different weights, it is shown that a monopoly equilibrium is destabilized to generate a limit cyc...
متن کاملDissipativity of Neural Networks with Continuously Distributed Delays
In this paper, we study the dissipativity and existence of a global attracting set for neural networks models with continuously distributed delays. We use nonnegative matrix and differential inequality techniques to obtain results under general conditions. Also, we give an example to illustrate our results.
متن کاملμ-Stability of Impulsive Neural Networks with Unbounded Time-Varying Delays and Continuously Distributed Delays
This paper is concerned with the problem of μ-stability of impulsive neural systems with unbounded time-varying delays and continuously distributed delays. Some μ-stability criteria are derived by using the Lyapunov-Krasovskii functional method. Those criteria are expressed in the form of linear matrix inequalities LMIs , and they can easily be checked. A numerical example is provided to demons...
متن کاملBounded dynamic data allocation in distributed systems
Recently, an interesting dynamic data allocation algorithm for the management of replicated data in distributed systems has been presented by Wolfson and Jajodia. We analyze this approach from cost as well as from availability perspectives and suggest an improved algorithm that exhibits superior characteristics. Our approach establishes lower and upper bounds in the number of replicas for guara...
متن کاملLoad Balancing in Dynamic Networks by Bounded Delays Asynchronous Diffusion
Load balancing is a well known problem, which has been extensively addressed in parallel algorithmic. However, there subsist some contexts in which the existing algorithms cannot be used. One of these contexts is the case of dynamic networks where the links between the different elements are intermittent. We propose in this paper an efficient algorithm, based on asynchronous diffusion, to perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos, Solitons & Fractals
سال: 2003
ISSN: 0960-0779
DOI: 10.1016/s0960-0779(03)00067-5